Model Checking with Abstract Types
نویسندگان
چکیده
منابع مشابه
Model checking with abstract types
Model checking the design of a software system can be supported by providing an interface from a high-level modelling language, which is suitable for describing software design, to a given model checking tool. In order to cope with the higher complexity of software systems, we additionally need a means for reducing the system’s state space. This can be done be applying abstraction to large or i...
متن کاملAbstract Regular Model Checking
Regular Model Checking Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar To cite this version: Ahmed Bouajjani, Peter Habermehl, Tomas Vojnar. Abstract Regular Model Checking. Alur, Rajeev and Peled, Doron A. International Conference on Computer Aided Verification 2004, 2004, Boston, United States. Springer Verlag, pp.372-386, 2004, LNCS. HAL Id: hal-00159512 https://hal.archives-ou...
متن کاملModel Checking with Formula-Dependent Abstract Models
Abstract. We present a model checking algorithm for CTL (and full CTL) which uses an iterative abstraction refinement strategy. In each iteration we call a standard model checker for the abstract models i. If i does not satisfy Φ we refine the abstract model i yielding another abstract model i 1 and (re-)call the model checker to i 1. Otherwise the formula holds for the original system . Our al...
متن کاملModel checking abstract state machines
State Machines (ASM) ist eine formale Spezifikationssprache, die es erlaubt, auf einem hohen Abstraktionsniveau zu modellieren. Sie ist gut geeignet für verschiedenartigste Anwendungen. Computerbasierte Werkzeugunterstützung ist in Form von Editoren, Typecheckern und Simulatoren vorhanden. ASM ist außerdem in die Logiken zweier Theorembeweiser eingebettet worden, die interaktives Beweisen unter...
متن کاملTermination checking with types
The paradigm of type-based termination is explored for functional programming with recursive data types. The article introducesΛμ , a lambda-calculus with recursion, inductive types, subtyping and bounded quantification. Decorated type variables representing approximations of inductive types are used to track the size of function arguments and return values. The system is shown to be type safe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00264-6